DEBORAH: A Tool for Worst-Case Analysis of FIFO Tandems
نویسندگان
چکیده
Recent results on Network Calculus applied to FIFO networks show that, in the general case, end-to-end delay bounds cannot be computed in a closed form, whereas solving non-linear programming problems is instead required. Furthermore, it has been shown that these bounds may be larger than the actual worst-case delay, which also calls for computing lower bounds on the latter. This paper presents DEBORAH (DElay BOund Rating AlgoritHm), a tool for computing upper and lower bounds to the worst-case delay in FIFO tandem networks. DEBORAH can analyze tandems of up to several tens of nodes in reasonable time on off-the-shelf hardware. We overview the various algorithms used by DEBORAH to perform the various steps of the computations, and describe its usage.
منابع مشابه
Computation and Tightness Assessment of End-to-end Delay Bounds in FIFO-multiplexing Tandems
1 Part of the content of this report has appeared as [1] and [2]. ABSTRACT This paper addresses the problem of estimating the worst-case endto-end delay for a flow in a tandem of FIFO multiplexing nodes, following up our previous work [14]. We consider the state-of-theart method for computing delay bounds, i.e. upper bounds on the worst-case delay, called the Least Upper Delay Bound (LUDB) meth...
متن کاملA methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems
In this paper we address the problem of finding end-to-end delay bounds for single leaky-bucket shaped flows subject to FIFO multiplexing in tandems of rate-latency nodes. More specifically, we focus on a methodology, called the Least Upper Delay Bound (LUDB) method, which is based on Network Calculus. The latter has already been used for computing delay bounds in tandems in which the path of t...
متن کاملSensitivity Analysis of Cache Replacement Policies
Caches are commonly employed to hide the latency gap between memory and the CPU by exploiting locality in memory accesses. On today’s architectures a cache miss may cost several hundred CPU cycles. In order to fulfill stringent performance requirements, caches are also used in hard real-time systems. In such systems, upper and lower bounds on the execution time of tasks have to be computed. Dif...
متن کاملComputing Tighter Delay Bounds for Non-Rate Controlled FIFO Networks by means of a more Detailed Tra c Model
Current algorithms for schedulability analyses of the worst case delay and worst case buuer requirements for real-time network traac have made one of two assumptions. 1) The networks are rate controlled (i.e. the source traac pattern is reconstructed at each node) or 2) Traac from multiple channels sharing a physical link can arrive simultaneously. This paper presents analysis which removes the...
متن کاملPerformance, Scalability, and Semantics of Concurrent FIFO Queues
We introduce the notion of a k-FIFO queue which may dequeue elements out of FIFO order up to a constant k ≥ 0. Retrieving the oldest element from the queue may require up to k+ 1 dequeue operations (bounded fairness), which may return elements not younger than the k + 1 oldest elements in the queue (bounded age) or nothing even if there are elements in the queue. A k-FIFO queue is starvation-fr...
متن کامل